Uniquely forced perfect matching and unique 3-edge-coloring
نویسندگان
چکیده
منابع مشابه
Uniquely forced perfect matching and unique 3-edge-coloring
Let G be a cubic graph with a perfect matching. An edge e of G is a forcing edge if it is contained in a unique perfect matching M , and the perfect matching M is called uniquely forced. In this paper, we show that a 3-connected cubic graphwith a uniquely forced perfect matching is generated from K4 via Y → 1-operations, i.e., replacing a vertex by a triangle, and further a cubic graph with a u...
متن کاملUnique Perfect Phylogeny Characterizations via Uniquely Representable Chordal Graphs
The perfect phylogeny problem is a classic problem in computational biology, where we seek an unrooted phylogeny that is compatible with a set of qualitative characters. Such a tree exists precisely when an intersection graph associated with the character set, called the partition intersection graph, can be triangulated using a restricted set of fill edges. Semple and Steel used the partition i...
متن کاملUniquely Edge-3-Colorable Graphs and Snarks
A cubic graph G is uniquely edge-3-colorable if G has precisely one 1-factorization. It is proved in this paper, if a uniquely edge-3-colorable, cubic graph G is cyclically 4-edgeconnected, but not cyclically 5-edge-connected, then G must contain a snark as a minor. This is an approach to a conjecture that every triangle free uniquely edge-3-colorable cubic graph must have the Petersen graph as...
متن کاملOn the Bipartite Unique Perfect Matching Problem
In this note, we give tighter bounds on the complexity of the bipartite unique perfect matching problem, bipartite-UPM. We show that the problem is in C=L and in NL , both subclasses of NC. We also consider the (unary) weighted version of the problem. We show that testing uniqueness of the minimum-weight perfect matching problem for bipartite graphs is in L= and in NL. Furthermore, we show that...
متن کامل3-consecutive Edge Coloring of a Graph
Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length 3. The 3 -consecutive edge coloring number ψ′ 3c(G) of G is the maximum number of colors permitted in a coloring of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then e1 or e3 receives the color of e2. Here we initiate the study of ψ′ 3c(G). A close relation be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.07.002